The largest demigenus of a bipartite signed graph
نویسندگان
چکیده
منابع مشابه
The largest demigenus of a bipartite signed graph
A graph with signed edges is orientation embedded in a surface when it is topologically embedded so that one trip around a closed path preserves or reverses orientation according as the path's sign product is positive or negative. We nd the smallest surface within which it is possible to orientation-embed the complete bipartite signed graph K r;s , which is obtained from the complete bipartite ...
متن کاملThe Largest Parity Demigenus of a Simple Graph
A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according as its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is Euler characteristic) over all surfaces S in which 1 can be parity embedded. We calculate the maximum parity demigenus over all loopless graphs of order n. As a corollary we strengthe...
متن کاملThe H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملSigned Degree Sequences in Signed Bipartite Graphs
A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...
متن کاملSigned degree sets in signed bipartite graphs
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00349-6